#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;

string s1, s2;
const int N = 1e5;
int a[N], b[N], c[N],s[N];

int main()
{
	cin >> s1 >> s2;
	int j = 1, k = 1;
	for (int i = s1.size() - 1; i >= 0; i--)
	{
		a[j++] = s1[i]-'0';
	}
	for (int i = s2.size() - 1; i >= 0; i--)
	{
		b[k++] = s2[i]-'0';
	}

	for (int i = 1; i <= s1.size(); i++)
	{
		for (int j = 1; j <= s2.size(); j++)
		{
			s[i + j - 1] = a[i] * b[j];
		}
	}
	int ma = s1.size() + s2.size() - 1;
	int ans = 0;
	for (int i = 1; i <= ma; i++)
	{
		ans = ans + s[i];
		c[i] = ans % 10;
		ans /= 10;
	}
	if (ans)
	{
		c[++ma] = ans;
	}
	while (c[ma] == 0 && ma > 1)
	{
		ma--;
	}
	for (int i = ma; i >= 1; i--)
	{
		cout << c[i];
	}
	return 0;
}